Dilations and degeneracy in network controllability

نویسندگان
چکیده

برای دانلود باید عضویت طلایی داشته باشید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

Controllability transition and nonlocality in network control.

A common goal in the control of a large network is to minimize the number of driver nodes or control inputs. Yet, the physical determination of control signals and the properties of the resulting control trajectories remain widely underexplored. Here we show that (i) numerical control fails in practice even for linear systems if the controllability Gramian is ill conditioned, which occurs frequ...

متن کامل

Key to Network Controllability

Liu et. al. recently proposed a minimum number of driver nodes, ND, needed to obtain full structural controllability over a directed network [1]. Driver nodes are unmatched nodes, from which there are directed paths to all matched nodes. Their most important assertion is that a system’s controllability is to a great extent encoded by the underlying network’s degree distribution, P (kin, kout). ...

متن کامل

Security-Aware Network Analysis for Network Controllability

Although people use critical, redundant and ordinary categories to concisely distinguish the importance of edges in maintaining the controllability of networks in linear timeinvariant (LTI) model, a specific network analysis is still uncertain to confirm edges of each category and guide further edge protection. Given a large, sparse, Erdős-Rényi random digraph that is in LTI model and has a kno...

متن کامل

Attack Vulnerability of Network Controllability

Controllability of complex networks has attracted much attention, and understanding the robustness of network controllability against potential attacks and failures is of practical significance. In this paper, we systematically investigate the attack vulnerability of network controllability for the canonical model networks as well as the real-world networks subject to attacks on nodes and edges...

متن کامل

Robustness analysis of network controllability

Structural controllability, which is an interesting property of complex networks, attracts many researchers from various fields. The maximum matching algorithm was recently applied to explore the minimum number of driver nodes, where control signals are injected, for controlling the whole network. Here we study the controllability of directed Erdös–Rényi and scale-free networks under attacks an...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

ژورنال

عنوان ژورنال: Scientific Reports

سال: 2021

ISSN: 2045-2322

DOI: 10.1038/s41598-021-88529-5